منابع مشابه
On Efficient Embeddings of Grids into Grids in PARIX
A hardware independent method of programming a massively parallel machine (MPP) can best be supported by a well-designed run-time environment. An important problem in this design is the ability of e ciently simulating networks di erent from the hardware topology. We will describe the mapping kernel of the virtual processors library for the commercial run-time system PARIX. This kernel contains ...
متن کاملOn Eecient Embeddings of Grids into Grids in Parix ?
A hardware independent method of programming a massively parallel machine (MPP) can best be supported by a well-designed run-time environment. An important problem in this design is the ability of eeciently simulating networks diierent from the hardware topology. We will describe the mapping kernel of the virtual processors library for the commercial run-time system PARIX 3. This kernel contain...
متن کاملEmbeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1
Abstract Let G and H be two simple undirected graphs An embedding of the graph G into the graph H is an injective mapping f from the vertices of G to the vertices of H together with a mapping which assigns to each edge u v of G a path between f u and f v in H The grid M r s is the graph whose vertex set is the set of pairs on nonnegative integers f i j i r j sg in which there is an edge between...
متن کاملEmbedding grids into grids: Techniques for large compression ratios
We return to the problem of embedding 2-dimensional (h × w ) guest grid graphs into 2dimensional (h ′ × w ′) host grid graphs, where w ′ < w , and h ′ is the smallest integer such that hw ≤ h ′w ′. This 2-dimensional problem has many applications in computer science including the simulation of one grid of processors by another of different shape. Also, it can likely be applied to more complex p...
متن کاملEmbedding Rectangular Grids into Square Grids with Dilation Two
Absfrucl-In this paper, a new technique, the multiple ripple propagation technique, is presented for mapping an h x w grid into a w x h grid such that the dilation cost is 2, i.e., such that any two neighboring nodes in the first grid are mapped onto two nodes in the second grid that are separated by a distance of at most 2. This technique is then used as a basic tool for mapping any rectangula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00224-9